#include<bits/stdc++.h>
#define ll long long
#define p 998244353ll
#define N 200000
#define K 400
using namespace std ;

inline int read(){
	int s=0,w=1;char c=getchar();
	while(c<48||c>57) {if(c=='-') w=-1;c=getchar();}
	while(c>=48&&c<=57) s=(s<<1)+(s<<3)+c-48,c=getchar();
	return s*w;
}

inline void write(ll x){
	if(x>9) write(x/10);
	putchar(x%10+48);
}

int n,k;
vector<int> a[N+100];

bool leg[102][102];
int F[102],Siz[102];
int find(int x){return F[x]==x?x:F[x]=find(F[x]);}
ll dp[102][102];

ll jc[N+K+100],inv[N+K+100];
ll getc(int x,int y){return jc[x]*inv[y]%p*inv[x-y]%p;}

int main(){

	freopen("soft.in","r",stdin);
	freopen("soft.out","w",stdout);
	
	n=read(),k=read();
	bool kk=0;
	for(int i=1;i<n;i++) {
		int x=read(),y=read();
		a[x].push_back(y),a[y].push_back(x);
		if(y!=x+1) {kk=1;break;}
	}
	
	if(n<=100&&k<=100){
		
		for(int i=1;i<=n;i++){
			for(int i=1;i<=n;i++) F[i]=i,Siz[i]=1;
			leg[i][i]=1;

			for(int j=i+1;j<=n;j++){
				for(int z=0;z<a[j].size();z++){
					int y=a[j][z];
					if(y<i||y>j) continue;
					if(find(y)==j) continue;
					Siz[j]+=Siz[find(y)];
					F[find(y)]=j;
				}
				leg[i][j]=(Siz[j]==j-i+1);
			}
		}
		
		dp[0][0]=1;
		for(int i=0;i<n;i++)
			for(int j=0;j<k;j++)
				for(int z=i+1;z<=n;z++)
					dp[z][j+1]=(dp[z][j+1]+dp[i][j]*leg[i+1][z])%p;
		
		for(int i=1;i<=k;i++) write(dp[n][i]),puts("");
		return 0;
	}
	
	if(!kk){
		jc[0]=1;for(int i=1;i<=n+k;i++) jc[i]=jc[i-1]*i%p;
		inv[0]=inv[1]=1;for(int i=2;i<=n+k;i++) inv[i]=(p-p/i*inv[p%i]%p)%p;
		for(int i=2;i<=n+k;i++) inv[i]=inv[i-1]*inv[i]%p;
		
		for(int i=1;i<=k;i++)
			write(getc(n-1,i-1)),puts("");
		
		return 0;
	}
	
	cout<<"hhh"<<endl;

	return 0;
}



